Comparison between BZAU, SRMI and MRM Conjugate Gradient Methods in Minimization Problems

Nurul Akmal Mohamed

QR Code Link :
Type :	article
Subject :	Q Science (General)
Main Author :	Nurul Akmal Mohamed
Additional Authors :	Lai, L. Y. Ibrahim, N. F.
Title :	Comparison between BZAU, SRMI and MRM Conjugate Gradient Methods in Minimization Problems

Place of Production :	Tanjong Malim
Publisher :	Fakulti Sains dan Matematik
Year of Publication :	2019
Corporate Name :	Universiti Pendidikan Sultan Idris
PDF Full Text :	Login required to access this item.

Abstract : Universiti Pendidikan Sultan Idris

The conjugate gradient method is one of the best methods that can be used to solve nonlinear unconstrained optimization problems. This method has gained the interest of researchers and has expanded rapidly. There are many versions of the conjugate gradient method. Each version claims to be ecient. In this paper, we make the comparison among three versions of the conjugate gradient method (MRM, SRMI and BZAU) by using exact line search. The methods were tested in terms of number of iteration and CPU time using 20 standard test functions. The result showed that MRM is the most ecient followed by BZAU and then SRMI. However, BZAU successfully found all the minimizers of the test functions whereas both SRMI and MRM failed at least once. In order to test the robustness of the methods, extensive tests are required.

References

Baluch, B., Salleh, Z., Alhawarat, A., and Roslan, U. A. M. (2017). A new mod-Led three-term conjugate gradient method with sucient descent property and its global convergence. Journal of Mathematics.

Dai, Z. and Wen, F. (2012). Another improved wei-yao-liu nonlinear conjugate gradient method with sucient descent property. Applied Mathematics and Computation, 218(14):74217430.

Fletcher, R. and Reeves, C. M. (1964). Function minimization by conjugate gradients. The computer journal, 7:149-154.

Hager, W. W. and Zhang, H. (2006). A survey of nonlinear conjugate gra- dient methods. Pacic Journal of Optimization. An International Journal,2(1):35-58.

Hamoda, H., Rivaie, M., Mamat, M., and Salleh, Z. (2015). A new nonlin-ear conjugate gradient coecient for unconstrained optimization. Applied Mathematical Sciences, 9(37):1813 -1822.

Hestenes, M. R. and Stiefel, E. (1952). Method of conjugate gradient for solving linear systems. Journal of Research of the National Bureau of Standards, 49:409-436.

Polak, E. and Ribiere, G. (1969). Note sur la convergence de directions con-juge`es. Rev. Francaise Informat Recherche Operationelle, pages 35-43.

Polyak, B. T. (1969). The conjugate gradient method in extreme problems. USSR Computational Mathematics and Mathematical Physics, 9:94-112.

Shapiee, N., Mamat, R. M., and Mohd, I. (2014). A new modication of hestenesstiefel method with descent properties. AIP Conference Proceedings, pages 520-526.

Shoid, S., Rivaie, M., Mamat, M., and Salleh, Z. (2015). A new conjugate gradient method with exact line search. Applied Mathematical Sciences, 9(96):4799 - 4812.

Sun, M. and Liu, J. (2015). Three modied polak-ribiere-polyak conjugate gradient methods with sucient descent property. Journal of Inequalities and Applications, (1).

Wei, Z., Li, G., and Qi, L. (2006). New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. Applied Mathematics and Computation, 179(2):407 -430.

This material may be protected under Copyright Act which governs the making of photocopies or reproductions of copyrighted materials.
You may use the digitized material for private study, scholarship, or research.

Back to previous page